ON LAMPORTS COMPARISON BETWEEN LINEAR AND BRANCHING TIME LOGIC = COMPARAISON DE LAMPORT ENTRE LOGIQUE TEMPORELLE LINEAIRE ET RAMIFIEEGRAF SUSANNE.1983; ; FRA; GRENOBLE: I.M.A.G.; DA. 1983; IMAG/RR-348; 7 P.; 30 CM; ABS. FRE;[RAPP. RECH.-LAB. INFORM. MATH. APPL. GRENOBLE; VOL. RR-348]Report

ELIMINATING NULL RULES IN LINEAR TIMEHARRISON MA; YEHUDAI A.1981; COMPUT. J.; ISSN 0010-4620; GBR; DA. 1981; VOL. 24; NO 2; PP. 156-161; BIBL. 12 REF.Article

COMPLEXICITY RESULTS FOR BANDWIDTH MINIMIZATION.GAREY MR; GRAHAM RL; JOHNSON DS et al.1978; S.I.A.M.J. APPL. MATH.; U.S.A.; DA. 1978; VOL. 34; NO 3; PP. 477-495; BIBL. 1 P. 1/2Article

A FAST ALGORITHM FOR COPYING LIST STRUCTURES.CLARK DW.1978; COMMUNIC. A.C.M.; U.S.A.; DA. 1978; VOL. 21; NO 5; PP. 351-357; BIBL. 9 REF.Article

A LINEAR-TIME ON-LINE RECOGNITION ALGORITHM FOR "PALSTAR".GALIL Z; SEIFERAS J.1978; J. ASS. COMPUTG MACHIN.; U.S.A.; DA. 1978; VOL. 25; NO 1; PP. 102-111; BIBL. 12 REF.Article

THE TIME MEASURE OF ONE-TAPE TURING MACHINES DOES NOT HAVE THE PARALLEL COMPUTATION PROPERTY.BISKUP J.1978; S.I.A.M. J. COMPUTG; U.S.A.; DA. 1978; VOL. 7; NO 1; PP. 115-117; BIBL. 7 REF.Article

LINEAR-TIME COMPUTATION BY NONDETERMINISTIC MULTIDIMENSIONAL ITERATIVE ARRAYS.SEIFERAS JI.1977; S.I.A.M. J. COMPUTG; U.S.A.; DA. 1977; VOL. 6; NO 3; PP. 487-504; BIBL. 13 REF.Article

A NOTE ON LINEAR TIME SIMULATION OF DETERMINISTIC TWO-WAY PUSHDOWN AUTOMATA.JONES ND.1977; INFORM. PROCESSG LETTERS; NETHERL.; DA. 1977; VOL. 6; NO 4; PP. 110-112; BIBL. 3 REF.Article

IMPLEMENTATION OF PERMUTATION FUNCTIONS IN ILLIAC IV-TYPE COMPUTERS.ORCUTT SE.1976; I.E.E.E. TRANS. COMPUTERS; U.S.A.; DA. 1976; VOL. 25; NO 9; PP. 929-936; BIBL. 17 REF.Article

A FAST STRING SEARCHING ALGORITHM.BOYER RS; MOORE JS.1977; COMMUNIC. A.C.M.; U.S.A.; DA. 1977; VOL. 20; NO 10; PP. 762-772; BIBL. 5 REF.Article

A linear-time algorithm to solve the Sports League Scheduling Problem (prob026 of CSPLib)HAMIEZ, Jean-Philippe; HAO, Jin-Kao.Discrete applied mathematics. 2004, Vol 143, Num 1-3, pp 252-265, issn 0166-218X, 14 p.Article

An approximation scheme for strip packing of rectangles with bounded dimensionsFERNANDEZ DE LA VEGA, W; ZISSIMOPOULOS, V.Discrete applied mathematics. 1998, Vol 82, Num 1-3, pp 93-101, issn 0166-218XArticle

The complexity of assigning genotypes to people in a pedigree consistentlySUZUKI, Susumu; IBARAKI, Toshihide.Discrete mathematics. 2007, Vol 307, Num 16, pp 2122-2131, issn 0012-365X, 10 p.Article

Peg-solitaire, string rewriting systems and finite automataRAVIKUMAR, B.Theoretical computer science. 2004, Vol 321, Num 2-3, pp 383-394, issn 0304-3975, 12 p.Article

Non uniform random generation of generalized Motzkin pathsBRLEK, Srecko; PERGOLA, Elisa; ROQUES, Olivier et al.Acta informatica. 2006, Vol 42, Num 8-9, pp 603-616, issn 0001-5903, 14 p.Article

A linear time algorithm for recognizing regular Boolean functionsMAKINO, Kazuhisa.Journal of algorithms (Print). 2002, Vol 43, Num 2, pp 155-176, issn 0196-6774Article

An efficient parallel algorithm for the general planar monotone circuit value problemVIJAYA RAMACHANDRAN; HONGHUA YANG.SIAM journal on computing (Print). 1996, Vol 25, Num 2, pp 312-339, issn 0097-5397Article

A linear algorithm for determining the separation of convex polyhedraDOBKIN, D. P; KIRKPATRICK, D. G.Journal of algorithms (Print). 1985, Vol 6, Num 3, pp 381-392, issn 0196-6774Article

Linear time tree codesTINHOFER, G; SCHRECK, H.Computing (Wien. Print). 1984, Vol 33, Num 3-4, pp 211-225, issn 0010-485XArticle

On real time and linear time cellular automataBUCHER, W; CULIK, K. II.R.A.I.R.O. Informatique théorique. 1984, Vol 18, Num 4, pp 307-325, issn 0399-0540Article

Lempel, Even, and Cederbaum planarity methodBOYER, John M; FERNANDES, Cristina G; NOMA, Alexandre et al.Lecture notes in computer science. 2004, pp 129-144, issn 0302-9743, isbn 3-540-22067-4, 16 p.Conference Paper

Characterization of reachable/nonreachable cellular automata statesDAS, Sukanta; SIKDAR, Biplab K; PAL CHAUDHURI, P et al.Lecture notes in computer science. 2004, pp 813-822, issn 0302-9743, isbn 3-540-23596-5, 10 p.Conference Paper

On constrained minimum pseudotriangulationsROTE, Günter; CAO AN WANG; LUSHENG WANG et al.Lecture notes in computer science. 2003, pp 445-454, issn 0302-9743, isbn 3-540-40534-8, 10 p.Conference Paper

On minimum intersection of two minimum dominating sets of interval graphsCHANG, M.-S; HSU, C.-C.Discrete applied mathematics. 1997, Vol 78, Num 1-3, pp 41-50, issn 0166-218XArticle

Unique Horn renaming and Unique 2-SatisfiabilityHEBRARD, J.-J.Information processing letters. 1995, Vol 54, Num 4, pp 235-239, issn 0020-0190Article